Typed parametric polymorphism for aspects
نویسندگان
چکیده
We study the incorporation of generic types in aspect languages. Since advice acts likemethod update, such a study has to accommodate the subtleties of the interaction of classes,polymorphism and aspects. Indeed, simple examples demonstrate that current aspect com-piling techniques do not avoid runtime type errors.We explore type systems with polymorphism for two models of parametric polymor-phism: the type erasure semantics of Generic Java, and the type carrying semantics ofdesigns such as generic C#. Our main contribution is the design and exploration of asource-level type system for a parametric OO language with aspects. We prove progressand preservation properties.We believe our work is the first source-level typing scheme for an aspect-based extensionof a parametric object-oriented language.
منابع مشابه
From parametric polymorphism to models of polymorphic FPC
This paper shows how PILLY (Polymorphic Intuitionistic / Linear Lambda calculus with a fixed point combinator Y ) with parametric polymorphism can be used as a metalanguage for domain theory, as originally suggested by Plotkin more than a decade ago. Using Plotkin’s encodings of recursive types in PILLY we show how parametric models of PILLY give rise to models of FPC, a simply typed lambda cal...
متن کاملLightweight Parametric Polymorphism for Oberon
Strongly typed polymorphism is necessary for expressing safe reusable code. Two orthogonal forms of polymorphism exist: inclusion and parametric, the Oberon language only supports the former. We describe a simple extension to Oberon to support parametric polymor-phism. The extension is in keeping with the Oberon language: it is simple and has an explicit cost. In the paper we motivate the need ...
متن کاملUsing Modes to Ensure Subject Reduction for Typed Logic Programs with Subtyping
We consider a general prescriptive type system with parametric polymorphism and subtyping for logic programs. The property of subject reduction expresses the consistency of the type system w.r.t. the execution model: if a program is"well-typed", then all derivations starting in a"well-typed"goal are again"well-typed". It is well-established that without subtyping, this property is readily obtai...
متن کاملQuantifier Elimination and Parametric Polymorphism in Programming Languages
We present a simple and easy to understand explanation of ML type inference and parametric polymorphism within the framework of type monomorphism, as in the rst order typed lambda calculus. We prove the equivalence of this system with the standard interpretation using type polymorphism, and extend the equivalence to include polymorphic xpoints. The monomorphic interpretation gives a purely comb...
متن کاملA Logic for Parametric Polymorphism
In this paper we introduce a logic for parametric polymorphism. Just as LCF is a logic for the simply-typed -calculus with recursion and arithmetic, our logic is a logic for System F. The logic permits the formal presentation and use of relational parametricity. Parametricity yields|for example|encodings of initial algebras, nal co-algebras and abstract datatypes, with corresponding proof princ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Sci. Comput. Program.
دوره 63 شماره
صفحات -
تاریخ انتشار 2006